Logarithmic Representability of Integers as K-sums
نویسندگان
چکیده
A set A = Ak,n ⇢ [n] [ {0} is said to be an additive k-basis if each element in {0, 1, . . . , kn} can be written as a k-sum of elements of A in at least one way. Seeking multiple representations as k-sums, and given any function (n) ! 1, we say that A is said to be a truncated (n)-representative k-basis for [n] if for each j 2 [↵n, (k ↵)n] the number of ways that j can be represented as a k-sum of elements of Ak,n is ⇥( (n)). In this paper, we follow tradition and focus on the case (n) = log n, and show that a randomly selected set in an appropriate probability space is a truncated log-representative basis with probability that tends to one as n!1. This result is a finite version of a result proved by Erdős and extended by Erdős and Tetali.
منابع مشابه
The Triangular Theorem of Eight and Representation by Quadratic Polynomials
We investigate here the representability of integers as sums of triangular numbers, where the n-th triangular number is given by Tn = n(n + 1)/2. In particular, we show that f(x1, x2, . . . , xk) = b1Tx1 + · · · + bkTxk , for fixed positive integers b1, b2, . . . , bk, represents every nonnegative integer if and only if it represents 1, 2, 4, 5, and 8. Moreover, if ‘cross-terms’ are allowed in ...
متن کاملAn excluded minors method for infinite matroids
The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a finite field k if and only if all its finite minors are representable over k. We expect that the method we use to prove this will make it possible to lift m...
متن کاملOn the logarithmic factor in error term estimates in certain additive congruence problems
In additive number theory an important topic is the problem of finding an asymptotic formula for the number of solutions of a given congruence. In many additive congruences the error term estimates of asymptotic formulas contain logarithmic factors. The aim of the present paper is to illustrate application of double exponential sums and a multidimensional smoothing argument in removing these fa...
متن کاملDefining Sums of Products of Power Sums
We study the sums of products of power sums of positive integers and their generalizations, using the multiple products of their exponential generating functions. The generalizations include a closed form expression for the sums of products of infinite series of the form ∑∞ n=0 α n, 0 < |α| < 1, k ∈ N0 and the related Abel sum, which define, in a unified way, the sums of products of the power s...
متن کاملq-ANALOGUES OF THE SUMS OF POWERS OF CONSECUTIVE INTEGERS
Let n, k be the positive integers (k > 1), and let Sn,q(k) be the sums of the n-th powers of positive q-integers up to k − 1: Sn,q(k) = ∑k−1 l=0 ql. Following an idea due to J. Bernoulli, we explore a formula for Sn,q(k).
متن کامل